Theory Exploration for Interactive Theorem Proving
نویسنده
چکیده
Theory exploration is an automated reasoning technique for discovering and proving interesting properties about some set of given functions, constants and datatypes. In this note we describe ongoing work on integrating the HipSpec theory exploration system with the interactive prover Isabelle. We believe that such an integration would be beneficial for several reasons. In an interactive proof attempt a natural application would be to allow the user to ask for some suggestions of new lemmas that might help the current proof development. Theory exploration may also be used to automatically generate and prove some basic lemmas as a first step in a new theory development. Furthermore, when the theory exploration system is used as a stand-alone system, it should output a checkable proofs, for instance for Isabelle, so that sessions can be saved for future use.
منابع مشابه
Automating Inductive Proofs Using Theory Exploration
HipSpec is a system for automatically deriving and proving properties about functional programs. It uses a novel approach, combining theory exploration, counterexample testing and inductive theorem proving. HipSpec automatically generates a set of equational theorems about the available recursive functions of a program. These equational properties make up an algebraic specification for the prog...
متن کاملIntegrating Automated and Interactive Theorem Proving in Type Theory
We introduce an approach of integrating automated theorem proving techniques into the interactive theorem prover Agda. Our approach is generic and flexible, and can be combined with dependently typed programming. We have implemented the special cases of SAT solving and CTL model checking. The tool has been used for verifying the correctness of railway interlocking systems.
متن کاملTheory Exploration and Inductive Theorem Proving
We have built two state-of-the-art inductive theorem provers named HipSpec and Hipster. The main issue when automating proofs by induction is to discover essential helper lemmas. Our theorem provers use the technique theory exploration, which is amethod to systematically discover interesting conclusions about a mathematical theory. We use the existing theory exploration system QuickSpec which c...
متن کاملTheory Exploration with Theorema
Automated theorem proving is a well established subject in computer science. The advances made in the algorithmic techniques for automated theorem proving are impressive, see the survey paper [Loveland 1996]. Also, automated theorem proving has found various important applications in computer science. For example, Robinson’s resolution proving method launched a whole new programming paradigm, n...
متن کاملTPS: An Interactive and Automatic Tool for Proving Theorems of Type Theory
This is a demonstration of TPS, a theorem proving system for classical type theory (Church’s typed λ-calculus). TPS can be used interactively or automatically, or in a combination of these modes. An important feature of TPS is the ability to translate between expansion proofs and natural deduction proofs. CATEGORY: Demonstration
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013